Contention resolution with constant expected delay
نویسندگان
چکیده
منابع مشابه
Contention Resolution with Guaranteed Constant Expected Delay
We study contention resolution in multiple-access channels such as the Ethernet. Under a stochastic model of continuous packet generation from a set of n processors, we construct a protocol which guarantees constant expected delay for generation rates up to a xed constant 0 < 1. Previous protocols which are stable for constant arrival rates do not guarantee constant expected delay. The two prot...
متن کاملContention Resolution with Bounded Delay
When distributed processes contend for a shared resource, we need a good distributed contention resolution protocol, e.g., for multiple-access channels (ALOHA, Ethernet), PRAM emulation, and optical routing. Under a stochastic model of request generation from n synchronous processes, Raghavan & Upfal have shown a protocol which is stable for a positive request rate; their main result is that fo...
متن کاملCONTI: Constant-Time Contention Resolution for WLAN Access
Designing an efficient and fair access control protocol is a challenging task in the field of wireless networks. Often in the known schemes, one of the important performance metrics is enhanced at the expense of another. In this paper, we present a distributed access scheme that is based on the binary countdown mechanism. The proposed scheme has two main features: 1) the ability to resolve the ...
متن کاملOnline Contention Resolution Schemes
We introduce a new rounding technique designed for online optimization problems, which is related to contention resolution schemes, a technique initially introduced in the context of submodular function maximization. Our rounding technique, which we call online contention resolution schemes (OCRSs), is applicable to many online selection problems, including Bayesian online selection, oblivious ...
متن کاملOBS contention resolution performance
In this paper, a performance comparison of resolution policies specific to optical burst switching is presented. A framework, based on a reduced-load approximation, is developed to estimate path blocking probabilities in an optical burst switching network of arbitrary topology, in which any combination of the following resolution policies is in place: burst deflection, burst segmentation and li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2000
ISSN: 0004-5411,1557-735X
DOI: 10.1145/355541.355567